A survey of quantitative bounds for hypergraph Ramsey problems
نویسندگان
چکیده
The classical hypergraph Ramsey number rk(s, n) is the minimum N such that for every redblue coloring of the k-tuples of {1, . . . , N}, there are s integers such that every k-tuple among them is red, or n integers such that every k-tuple among them is blue. We survey a variety of problems and results in hypergraph Ramsey theory that have grown out of understanding the quantitative aspects of rk(s, n). Our focus is on recent developments. We also include several new results and proofs that have not been published elsewhere.
منابع مشابه
New lower bounds for hypergraph Ramsey numbers
The Ramsey number rk(s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1, . . . , N}, there are s integers such that every k-tuple among them is red, or n integers such that every k-tuple among them is blue. We prove the following new lower bounds for 4-uniform hypergraph Ramsey numbers: r4(5, n) > 2 n log n and r4(6, n) > 2 2 1/5 , where c is an absolute positive...
متن کاملA note on lower bounds for hypergraph Ramsey numbers
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform case, that r3(l, l, l) ≥ 2 c log log l . The old bound, due to Erdős and Hajnal, was r3(l, l, l) ≥ 2 2 log2 .
متن کاملThe Lifting of Graphs to 3-uniform Hypergraphs and Some Applications to Hypergraph Ramsey Theory
Given a simple graph Γ, we describe a “lifting” to a 3-uniform hypergraph φ(Γ) that sends the complement of Γ to the complement of φ(Γ). We consider the effects of this lifting on cycles, complete subhypergraphs, and complete subhypergraphs missing a single hyperedge. Our results lead to natural lower bounds for some hypergraph Ramsey numbers.
متن کاملMulticolor Ramsey numbers for triple systems
Given an r-uniform hypergraph H, the multicolor Ramsey number rk(H) is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K n yields a monochromatic copy of H. We investigate rk(H) when k grows and H is fixed. For nontrivial 3-uniform hypergraphs H, the function rk(H) ranges from √ 6k(1 + o(1)) to double exponential in k. We observe that rk(H) is polynomi...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کامل